Automaticity II: Descriptional complexity in the unary case
نویسندگان
چکیده
منابع مشابه
Automaticity II: Descriptional Complexity in the Unary Case
Let Z and d be finite alphabets, and let f be a map from C* to A. Then the deterministic automaticity of f, &(n), is defined to be the size of the minimum finite-state machine that correctly computes f on all inputs of size <n. A similar definition applies to languages L. We denote the nondeterministic analogue (for languages L) of automaticity by NL(~). In a previous paper, Shallit and Breitba...
متن کاملDescriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
Previously, self-verifying symmetric difference automata were defined and a tight bound of 2n−1−1 was shown for state complexity in the unary case. We now consider the non-unary case and show that, for every n≥ 2, there is a regular languageLn accepted by a non-unary self-verifying symmetric difference nondeterministic automaton with n states, such that its equivalent minimal deterministic fini...
متن کاملUnary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds
It is well known that a context-free language defined over a one-letter alphabet is regular. This implies that unary context-free grammars and unary pushdown automata can be transformed into equivalent finite automata. In this paper, we study these transformations from a descriptional complexity point of view. In particular, we give optimal upper bounds for the number of states of nondeterminis...
متن کاملParikh's Theorem and Descriptional Complexity
This thesis was carried out in the Laboratorio di Linguaggi e Combinatoria (LIN.COM), at the Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano. The thesis deals with some topics in the theory of formal languages, and specifically with the theory of context-free languages and the study of theirs descriptional complexity. The descriptional complexity of a formal struct...
متن کاملOn the Descriptional Complexity of Production Systems
In t h i s paper we f o r m a l i z e d i f f e r e n t methods f o r d e s c r i b i n g c o n t r o l knowledge in p roduc t i on systems by the concept of p r o d u c t i o n system schemes. In t h i s framework these methods are compared from the v iewpo in t o f d e s c r i p t i o n a l comp lex i t y g i v i n g us some i n s i g h t by which means problems can be descr ibed in an easy a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00189-2